The Unifiability Problem in Ground AC Theories
Identifieur interne : 00D045 ( Main/Exploration ); précédent : 00D044; suivant : 00D046The Unifiability Problem in Ground AC Theories
Auteurs : P. Narendran ; M. RusinowitchSource :
English descriptors
- KwdEn :
Abstract
We show that unifiability is decidable in theories presented by a set of ground equations with several associative-commutative symbols (ground AC theories). This result applies, for instance, to finitely presented commutative semigroups and it extends our previous work where we gave an algorithm for solving the uniform word problem in ground AC theories.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001222
- to stream Crin, to step Curation: 001222
- to stream Crin, to step Checkpoint: 003445
- to stream Main, to step Merge: 00D917
- to stream Main, to step Curation: 00D045
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="210">The Unifiability Problem in Ground AC Theories</title></titleStmt><publicationStmt><idno type="RBID">CRIN:narendran93a</idno><date when="1993" year="1993">1993</date><idno type="wicri:Area/Crin/Corpus">001222</idno><idno type="wicri:Area/Crin/Curation">001222</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001222</idno><idno type="wicri:Area/Crin/Checkpoint">003445</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003445</idno><idno type="wicri:Area/Main/Merge">00D917</idno><idno type="wicri:Area/Main/Curation">00D045</idno><idno type="wicri:Area/Main/Exploration">00D045</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">The Unifiability Problem in Ground AC Theories</title><author><name sortKey="Narendran, P" sort="Narendran, P" uniqKey="Narendran P" first="P." last="Narendran">P. Narendran</name></author><author><name sortKey="Rusinowitch, M" sort="Rusinowitch, M" uniqKey="Rusinowitch M" first="M." last="Rusinowitch">M. Rusinowitch</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>unification</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="687">We show that unifiability is decidable in theories presented by a set of ground equations with several associative-commutative symbols (ground AC theories). This result applies, for instance, to finitely presented commutative semigroups and it extends our previous work where we gave an algorithm for solving the uniform word problem in ground AC theories.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Narendran, P" sort="Narendran, P" uniqKey="Narendran P" first="P." last="Narendran">P. Narendran</name><name sortKey="Rusinowitch, M" sort="Rusinowitch, M" uniqKey="Rusinowitch M" first="M." last="Rusinowitch">M. Rusinowitch</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00D045 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00D045 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:narendran93a
|texte= The Unifiability Problem in Ground AC Theories
}}
| This area was generated with Dilib version V0.6.33. |  |